Look - ahead schemes for block Toeplitz systems and formalorthogonal matrix polynomials
نویسنده
چکیده
In this paper, a so-called auxiliary matrix polynomial Xn(z) and a true right formal orthogonal matrix polynomial (FOMP) A 1 n (z) is connected to each well-conditioned leading principal block submatrix of a given block Toeplitz matrix. From these two matrix polynomi-als, all other right FOMPs of block n of a system of block biorthogonal matrix polynomials with respect to the block Toeplitz moment matrix can be computed in an eecient way. The two matrix polynomials Xn(z) and A 1 n (z) also represent all solutions of a homogeneous interpolation problem connected to the symbol of the block Toeplitz moment matrix. On the other hand, they form part of the parameters of an inversion formula for the connected block Toeplitz matrix. However, numerical experiments show loss of accuracy when this inversion formula is used. Instead the solution of the block Toeplitz system can be updated leading to a weakly stable algorithm using O(2) FLOPS if is the dimension of the block Toeplitz matrix.
منابع مشابه
A Block Toeplitz Look - Ahead Schur
This paper gives a look-ahead Schur algorithm for nding the symmetric factorization of a Hermitian block Toeplitz matrix. The method is based on matrix operations and does not require any relations with orthogonal polynomials. The simplicity of the matrix based approach ought to shed new light on other issues such as parallelism and numerical stability.
متن کاملA Block Toeplitz Look-ahead Schur Algorithm
This paper gives a look-ahead Schur algorithm for nding the symmetric factorization of a Hermitian block Toeplitz matrix. The method is based on matrix operations and does not require any relations with orthogonal polynomials. The simplicity of the matrix based approach ought to shed new light on other issues such as parallelism and numerical stability.
متن کامل1 A look - ahead algorithm for the solution of block Toeplitz systems Marc
In this paper, we give a weakly stable algorithm to solve a block Toeplitz system of linear equations. If the \look-ahead" steps taken to compute the parameters of the inversion formula for the block Toeplitz matrix are small compared to the order n of the matrix, the algorithm requires O(n 2) oating point operations. The parameters of the inversion formula are interpreted and computed in a rec...
متن کاملA look-ahead Schur Algorithm
The classical Schur algorithm computes the LDL T factorization of a symmetric Toeplitz matrix in O(n 2) operations, but requires that all the principal minors of the matrix be nonsingular. Look-ahead schemes have been proposed to deal with matrices that have exactly singular principal minors 9], 11]. Unfortunately, these algorithms cannot be extended to matrices that have ill-conditioned princi...
متن کاملNORTH- HOLLAND High Performance Algorithms for Toeplitz and Block Toeplitz Matrices
In this paper, we present several high performance variants of the classical Schur algorithm to factor various Toeplitz matrices. For positive definite block Toeplitz matrices, we show how hyperbolic Householder transformations may be blocked to yield a block Schur algorithm. This algorithm uses BLAS3 primitives and makes efficient use of a memory hierarchy. We present three algorithms for inde...
متن کامل